Nullity Invariance for Pivot and the Interlace Polynomial

نویسندگان

Robert Brijder

Hendrik Jan Hoogeboom

چکیده

We show that the effect of principal pivot transform on the nullity values of the principal submatrices of a given (square) matrix is described by the symmetric difference operator (for sets). We consider its consequences for graphs, and in particular generalize the recursive relation of the interlace polynomial and simplify its proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

9 S ep 2 00 2 A TWO - VARIABLE INTERLACE POLYNOMIAL RICHARD

Generalizing a previous one-variable " interlace polynomial " , we consider a new interlace polynomial in two variables. The polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the differences are that our expansion is over vertex rather than edge subsets, the rank of the subset appears positively rathe...

متن کامل

Isotropic systems and the interlace polynomial

Through a series of papers in the 1980’s, Bouchet introduced isotropic systems and the Tutte-Martin polynomial of an isotropic system. Then, Arratia, Bollobás, and Sorkin developed the interlace polynomial of a graph in [ABS00] in response to a DNA sequencing application. The interlace polynomial has generated considerable recent attention, with new results including realizing the original inte...

متن کامل

Distance Hereditary Graphs and the Interlace Polynomial

The vertex-nullity interlace polynomial of a graph, described by Arratia, Bollobás and Sorkin in [ABS00] as evolving from questions of DNA sequencing, and extended to a two-variable interlace polynomial by the same authors in [ABS04b], evokes many open questions. These include relations between the interlace polynomial and the Tutte polynomial and the computational complexity of the vertex-null...

متن کامل

2 00 7 On the Complexity of the Interlace Polynomial ∗ Markus Bläser , Christian Hoffmann

We consider the two-variable interlace polynomial introduced by Arratia, Bollobás and Sorkin (2004). We develop two graph transformations which allow us to derive point-to-point reductions for the interlace polynomial. Exploiting these reductions we obtain new results concerning the computational complexity of evaluating the interlace polynomial at a fixed point. Regarding exact evaluation, we ...

متن کامل